A PROPOSAL FOR OPERATIONAL SEMANTICS AND EQUIVALENCE OF FINITE ASYNCHRONOUS PROCESSESMEJIA L.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 107; PP. 387-400; BIBL. 8 REF.Conference Paper

SEMANTICS OF CSP VIA TRANSLATION INTO CCSASTESIANO E; ZUCCA E.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 172-182; BIBL. 10 REF.Conference Paper

UNE SEMANTIQUE OPERATIONNELLE DE PROCESSUS DISTRIBUES ASYNCHRONES = AN OPERATIONAL SEMANTIC OF ASYNCHRONOUS DISTRIBUTED PROCESSESMEJIA ESLAVA LUIS FERNANDO.1981; ; FRA; DA. 1981; NON PAG.; 30 CM; BIBL. 20 REF.; TH. 3E CYCLE: MATH./PARIS 7/1981Thesis

CORRECTNESS OF PROGRAMS WITH FUNCTION PROCEDURESDE BAKKER JW; KLOP JW; MEYER JJC et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 94-112; BIBL. 23 REF.Conference Paper

NONDETERMINISM AND JULLY ABSTRACT MODELSASTESIANO E; COSTA G.1980; R.A.I.R.O. INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1980; VOL. 14; NO 4; PP. 323-347; ABS. FRE; BIBL. 10 REF.Article

FULL ABSTRACTION FOR SEQUENTIAL LANGUAGES: THE STATE OF THE ART = MODELE COMPLETEMENT ADEQUAT DE LANGAGES SEQUENTIELS: L'ETAT DE L'ARTBERRY GERARD; CURIEN PIERRE LOUIS; LEVY JEAN JACQUES et al.1983; ; FRA; PARIS: IMPR. I.N.R.I.A.; DA. 1983; INRIA/RR-197; 43 P.; 30 CM; ABS. FRE; BIBL. 46 REF.;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 197]Report

AN OPERATIONAL SEMANTICS FOR CSPPLOTKIN G.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 250-252; BIBL. 2 REF.Conference Paper

ON EFFECTIVE COMPUTATIONS OF NON-DETERMINISTIC SCHEMESPOIGNE A.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 313-336; BIBL. 16 REF.Conference Paper

A THEORY OF NONDETERMINISMKENNAWAY JR; HOARE CAR.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 338-350; BIBL. 6 REF.Conference Paper

Priority Rewrite systems for OSOS process languagesULIDOWSKI, Irek.Lecture notes in computer science. 2003, pp 87-102, issn 0302-9743, isbn 3-540-40753-7, 16 p.Conference Paper

A non-SOS operational semantics for a process algebraFRACZAK, W; ZAREMBA, M. B.Information processing letters. 1998, Vol 68, Num 1, pp 47-54, issn 0020-0190Article

Contribution à la réalisation d'une spécification formelle pour PROLOGRichard, Gilles; Lorho, Bernard.1989, 195 p.Thesis

Proving properties of dynamic process networksDAM, M.Information and computation (Print). 1998, Vol 140, Num 2, pp 95-114, issn 0890-5401Article

A format for semantic equivalence comparisonGALPIN, Vashti.Theoretical computer science. 2003, Vol 309, Num 1-3, pp 65-109, issn 0304-3975, 45 p.Article

Verification-oriented language C-light and its structural operational semanticsNEPOMNIASCHY, Valery A; ANUREEV, Igor S; PROMSKY, Alexey V et al.Lecture notes in computer science. 2003, pp 103-111, issn 0302-9743, isbn 3-540-20813-5, 9 p.Conference Paper

Distributed processes and location failuresRIELY, J; HENNESSY, M.Lecture notes in computer science. 1997, pp 471-481, issn 0302-9743, isbn 3-540-63165-8Conference Paper

High level expressions with their SOS semanticsKLAUDEL, H; RIEMANN, R.-C.Lecture notes in computer science. 1997, pp 288-301, issn 0302-9743, isbn 3-540-63141-0Conference Paper

On modular properties of higher order extensional lambda calculiDI COSMO, R; GHANI, N.Lecture notes in computer science. 1997, pp 237-247, issn 0302-9743, isbn 3-540-63165-8Conference Paper

An extended Theory of primitive objects : First order systemLIQUORI, L.Lecture notes in computer science. 1997, pp 146-169, issn 0302-9743, isbn 3-540-63089-9Conference Paper

Dependency-based action refinementRENSINK, A; WEHRHEIM, H.Lecture notes in computer science. 1997, pp 468-477, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Probabilistic concurrent constraint programmingGUPTA, V; JAGADEESAN, R; SARASWAT, V et al.Lecture notes in computer science. 1997, pp 243-257, issn 0302-9743, isbn 3-540-63141-0Conference Paper

Process modeling with different qualities of knowledgeMAY, W.Lecture notes in computer science. 1997, pp 436-450, issn 0302-9743, isbn 3-540-63095-3Conference Paper

ABSTRACT DATA TYPES AND REWRITING SYSTEMS: APPLICATION TO THE PROGRAMMING OF ALGEBRAIC ABSTRACT DATA TYPES IN PROLOGBERGMAN M; DERANSART P.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 101-116; BIBL. 13 REF.Conference Paper

METRIC INTERPRETATIONS OF INFINITE TREES AND SEMANTICS OF NON DETERMINISTIC RECURSIVE PROGRAMSARNOLD A; NIVAT M.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 2; PP. 181-205; BIBL. 17 REF.Article

SEMANTICS: ALGEBRAS, FIXED POINTS, AXIOMSMAJSTER CEDERBAUM ME.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 394-408; BIBL. 37 REF.Conference Paper